Pancyclicity and Cayley graphs on generalized dihedral groups
نویسندگان
چکیده
منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملHamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کاملDistance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملIsoperimetric Numbers of Cayley Graphs Arising from Generalized Dihedral Groups
Let n, x be positive integers satisfying 1 < x < n. Let Hn,x be a group admitting a presentation of the form 〈a, b | a = b = (ba) = 1〉. When x = 2 the group Hn,x is the familiar dihedral group, D2n. Groups of the form Hn,x will be referred to as generalized dihedral groups. It is possible to associate a cubic Cayley graph to each such group, and we consider the problem of finding the isoperimet...
متن کاملDiameter 2 Cayley graphs of dihedral groups
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree d. We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically d/2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2016
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2016.v7.n2.a7